220604

This research proposes a novel minimal-overlap centrality-driven gateway designation method for real-time wireless sensor networks (WSNs). The goal is to enhance network schedulability by design, particularly, by exploiting the relationship between path node-overlaps and gateway designation. To this aim, we define a new metric termed minimal-overlap network centrality which characterizes the overall overlapping degree between all the active flows in the network when a given node is selected as gateway. The metric is then used to designate as gateway the node which produces the least overall number of path overlaps. For the purposes of evaluation, we assume a time-synchronized channel-hopping (TSCH) WSN under centralized earliest-deadline-first (EDF) scheduling and shortest-path routing. The assessment of the WSN traffic schedulability suggests our approach is dominant over classical network centrality metrics, namely, eigenvector, closeness, betweenness, and degree. Notably, it achieves up to 50% better schedulability than a degree centrality benchmark.This work was partially supported by National Funds through FCT/MCTES (Portuguese Foundation for Science and Technology), within the CISTER Research Unit (UIDB/04234/2020); by the Operational Competitiveness Programme and Internationalization (COMPETE 2020) under the PT2020 Agreement, through the European Regional Development Fund (ERDF); also by FCT and the ESF (European Social Fund) through the Regional Operational Programme (ROP) Norte 2020, under PhD grant 2020.06685.BDN/

Automatic Link Balancing Using Fuzzy Logic Control of Handover Parameter

Postprint (published version

Automatic Link Balancing Using Fuzzy Logic Control of Handover Parameter

Postprint (published version

230702

This article presents a novel centrality-driven gateway designation framework for the improved real-time performance of low-power wireless sensor networks (WSNs) at system design time. We target time-synchronized channel hopping (TSCH) WSNs with centralized network management and multiple gateways with the objective of enhancing traffic schedulability by design. To this aim, we propose a novel network centrality metric termed minimal-overlap centrality that characterizes the overall number of path overlaps between all the active flows in the network when a given node is selected as gateway. The metric is used as a gateway designation criterion to elect as a gateway the node leading to the minimal number of overlaps. The method is then extended to multiple gateways with the aid of the unsupervised learning method of spectral clustering. Concretely, after a given number of clusters are identified, we use the new metric at each cluster to designate as cluster gateway the node with the least overall number of overlaps. Extensive simulations with random topologies under centralized earliest-deadline-first (EDF) scheduling and shortest-path routing suggest our approach is dominant over traditional centrality metrics from social network analysis, namely, eigenvector, closeness, betweenness, and degree. Notably, our approach reduces by up to 40% the worst-case end-to-end deadline misses achieved by classical centrality-driven gateway designation methods.This work was partially supported by National Funds through FCT/MCTES (Portuguese Foundation for Science and Technology), within the CISTER Research Unit (UIDB/04234/2020); by the Operational Competitiveness Programme and Internationalization (COMPETE 2020) under the PT2020 Agreement, through the European Regional Development Fund (ERDF); also by FCT and the ESF (European Social Fund) through the Regional Operational Programme (ROP) Norte 2020, under PhD grant 2020.06685.BD.info:eu-repo/semantics/publishedVersio

211007

This work will demonstrate a new flavor of the RA-TDMA set of protocols, namely RA-TDMAs+, which uses IEEE-802.11 (WiFi) COTS hardware in ad-hoc mode to set up a dynamic mesh network of mobile nodes with highbandwidth. The protocol uses topology tracking to configure the TDMA frame and robust relative synchronization to define the TDMA slots without resorting to a global clock and in the presence of interfering traffic. The demo will set up a small-scale testbed using COTS hardware, thus evidencing the feasibility of the approach, and it will show 1clive plots 1d of the temporal (synchronization) and topological views of the network.This work was partially supported by National Funds through FCT/MCTES (Portuguese Foundation for Science and Technology), within the CISTER Research Unit (UIDB/04234/2020); by the Operational Competitiveness Programme and Internationalization (COMPETE 2020) under the PT2020 Agreement, through the European Regional Development Fund (ERDF); also by FCT and the ESF (European Social Fund) through the Regional Operational Programme (ROP) Norte 2020, under PhD grant 2020.06685.BD; and within the AQUAMON project (PTDC/CCI-COM/30142/2017).info:eu-repo/semantics/publishedVersio

220901

Unmanned vehicles used in ocean science, defense operations and commercial activities collect large amounts of data that is further processed onshore. For real-time information exchange, the wireless link between the unmanned vehicle and onshore devices must be reliable. In this work, we empirically evaluate a WiFi link between an autonomous underwater vehicle on the surface and an onshore device under real-world conditions. This work allowed i) collecting a large-scale realistic dataset and ii) identifying major factors impairing communication in such scenarios. The TX-RX antenna alignment, the operation mode (manual vs automatic) and varying reflecting surface induced by AUV mobility lead to sudden changes (e.g. nulls) in the received signal strength that can be larger than 20 dB. This study provides useful insights to the design of robust vessel-to-shore short-range communications.info:eu-repo/semantics/publishedVersio

Joint Scheduling, Routing and Gateway Designation in Real-Time TSCH Networks

International audienceThis research proposes a co-design framework for scheduling, routing and gateway designation to improve the real-time performance of low-power wireless mesh networks. We target time-synchronized channel hopping (TSCH) networks with centralized network management and a single gateway. The end goal is to exploit existing trade-offs between the three dimensions to enhance traffic schedulability at systems’ design time. The framework we propose considers a global Earliest-Deadline-First (EDF) scheduler that operates in conjunction with the minimal-overlap (MO) shortest-path routing, after a centrality-driven gateway designation is concluded. Simulation results over varying settings suggest our approach can lead to optimal or near-optimal real-time network performance, with 3 times more schedulable flows than a naive real-time configuration

Minimal-Overlap Centrality for Multi-Gateway Designation in Real-Time TSCH Networks

International audienceThis article presents a novel centrality-driven gateway designation framework for the improved real-time performance oflow-power wireless sensor networks (WSNs) at system design time. We target time-synchronized channel hopping (TSCH)WSNs with centralized network management and multiple gateways with the objective of enhancing traffic schedulability bydesign. To this aim, we propose a novel network centrality metric termed minimal-overlap centrality that characterizes theoverall number of path overlaps between all the active flows in the network when a given node is selected as gateway. Themetric is used as a gateway designation criterion to elect as a gateway the node leading to the minimal number of overlaps.The method is then extended to multiple gateways with the aid of the unsupervised learning method of spectral clustering.Concretely, after a given number of clusters are identified, we use the new metric at each cluster to designate as clustergateway the node with the least overall number of overlaps. Extensive simulations with random topologies under centralizedearliest-deadline-first (EDF) scheduling and shortest-path routing suggest our approach is dominant over traditional centralitymetrics from social network analysis, namely, eigenvector, closeness, betweenness, and degree. Notably, our approach reducesby up to 40% the worst-case end-to-end deadline misses achieved by classical centrality-driven gateway designation methods